Fuzzy utility mining with upper-bound measure

Fuzzy utility mining has been an emerging research issue because of its simplicity and comprehensibility. Different from traditional fuzzy data mining, fuzzy utility mining considers not only quantities of items in transactions but also their profits for deriving high fuzzy utility itemsets. In this paper, we introduce a new fuzzy utility measure with the fuzzy minimum operator to evaluate the fuzzy utilities of itemsets. Besides, an effective fuzzy utility upper-bound model based on the proposed measure is designed to provide the downward-closure property in fuzzy sets, thus reducing the search space of finding high fuzzy utility itemsets. A two-phase fuzzy utility mining algorithm, named TPFU, is also proposed and described for solving the problem of fuzzy utility mining. At last, the experimental results on both synthetic and real datasets show that the proposed algorithm has good performance.     

基于集中式智能控制系统上位机数据采集算法

将集中式智能控制系统常用的二层结构改进为智能化的三层结构的设计方案,即传感器、智能巡检仪和上位机;上位机既可以直接读取传感器的数据也可读取智能巡检仪的数据,通过一定的通讯方式与PLC执行计算机连接,读取数据,分析计算,并像执行的计算机发出指令的设备;此方案较好地解决了二层结构所出现的问题,并且也适合较大规模的其它类型的控制系统;这种设计方案存在当规模大时上位机采集数据出现丢失的现象;文章提出了利用数据库的历史数据及控制曲线的线性特征数据采集算法,较好地解决了数据丢失的问题;并以温控系统为例仿真了在较大规模控制环境下的试验结果,已经研制出相应的产品并应用于实际的工业生产和教学实验中.     

基于ARM的电磁继电器参数检测仪

针对目前市场上存在的一些电磁继电器参数检测仪器的缺点,为了能够精确采集电磁继电器的吸合电压等主要参数,采用ARM技术和上、下位机方法,设计了一款基于ARMCortex—M3芯片sTM32F103ZET6单片机控制的电磁继电器综合参数检测仪。该仪器可完成对动断、动合、转换型直流继电器的线圈电阻、触点接触电阻、最小吸合电压、最大释放电压、吸合时间、释放时间等参数的测试。     

汉江上游径流演变趋势及影响因素分析

为了研究汉江上游径流演变趋势并对影响因素进行分析,根据1950～2007年汉江上游安康水文站的实测径流资料,对汉江上游径流在年际、年代、汛期（5～10月）的演变进行了分析。用径流量的累积曲线对径流变化趋势及突变进行了研究,并使用非参数Mann-Kendall法(M-K法)来检验径流的趋势变化。趋势分析表明,20世纪90年代以前,汉江上游径流呈现增加的趋势,但到了1990年后径流量锐减,进入21世纪后径流量也在减少,但减少趋势有所缓解。重点分析了1990年后汉江上游径流量锐减的主要原因,结果表明,径流减少主要原因为降水量的减少、气温的增高、下垫面的变化、社会经济耗水的增加和水资源开发利用等方面。     

Quasi-Upward Planarity

Abstract. An upward planar drawing of a directed graph (digraph) is a planar drawing such that all the edges are represented by curves monotonically increasing in the vertical direction. In this paper we introduce and study the concept of quasi-upward planarity. Quasi-upward planarity allows us to extend the upward planarity theory to a large class of digraphs including digraphs that also have directed cycles. First, we characterize the digraphs that have a quasi-upward planar drawing. Second, we give a polynomial time algorithm for computing ``optimal' quasi-upward planar drawings within a given planar embedding. Further, we apply branch and bound techniques to the problem of computing optimal quasi-upward planar drawings, considering all possible planar embeddings. The paper also contains experimental results about the proposed techniques.     

一种在元素与颜色规模相近时的有效着色算法及其应用

着色算法(color-coding)是求解NP难问题的重要手段之一.而在应用着色算法时,着色算法所产生的着色方案的规模极大地影响着问题的求解性能,故构造一个尽可能小的着色方案是着色算法所寻求的目标.目前存在的着色算法均基于完全散列函数,并要求元素数目n远大于颜色数目k,且k比较小,这个限制条件使得这些着色算法在一些实际情况下无法应用.该文主要研究在元素与颜色规模相近时(n2k)的有效着色算法,并着重分析在n2k情况下着色算法的性能.该文提出了一种基于划分思想的着色方案构造算法PBCC,证明了由PBCC产生的着色方案确实可以覆盖到所有的子集,并具体给出了可应用于(l,d)-(20,16)Motif查找问题的403种着色的构造方法.文章进一步分析了PBCC产生的着色方案规模,并证明了在n2k且n-k2的情况下,任何着色算法所产生的着色方案的规模|S(n,k)|都不小于[n/2 n-k] [[n n-k]-n/2 n-k]2~(n-k)]/(2~(n-k)-2).此外,文中也采用了渐进分析技术,证明了PBCC算法生成着色方案规模为O(e2Rootof(ex-eμx 1)(n-k)),在n=2k的情况下结果是O(2.62n-k);同时,文中也证明了n2k情况下着色方案规模的下界为2n-k.     

A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates

In this paper, we consider an identical parallel machine scheduling problem with release dates. The objective is to minimize the total weighted completion time. This problem is known to be strongly NP-hard. We propose some dominance properties and two lower bounds. We also present an efficient heuristic. A branch-and-bound algorithm, in which the heuristic, the lower bounds and the dominance properties are incorporated, is proposed and tested on a large set of randomly generated instances.     

一种新的覆盖粗糙集及其模糊性度量

在覆盖近似空间中定义了一类新的模糊集,给出了该类模糊集的模糊性度量,讨论模糊集及其模糊度量的性质,最后通过实例给出直观解释.     

连续时间部分可观Markov决策过程的策略梯度估计

针对连续时间部分可观Markov决策过程(CTPOMDP)的优化问题,本文提出一种策略梯度估计方法. 运用一致化方法,将离散时间部分可观Markov决策过程(DTPOMDP)的梯度估计算法推广到连续时间模型, 研究了算法的收敛性和误差估计问题,并用一个数值例子来说明该算法的应用.     

三电机变频调速系统的设计与实现

采用PROFIBUS现场总线建立S7—300PLC与西门子MMV变频器之间的现场通讯,满足了三电机调速系统实时数据传输的要求。开发了基于WinCC的上位机监控系统和基于S7—300PLC的下位机控制系统,建立了上位机与下位机之间的数据通讯,实现了控制过程可视化,使该系统的操作简4z,fb,过程信息明了化,最终实现了三电机调速系统的远程化智能控制。